Discrete logarithm

Results: 130



#Item
61Cryptographic protocols / Electronic commerce / Diffie–Hellman key exchange / XTR / ElGamal encryption / RSA / Discrete logarithm / Diffie–Hellman problem / Commitment scheme / Cryptography / Finite fields / Public-key cryptography

CS255: Cryptography and Computer Security Winter 2005 Assignment #3 Due: Monday, Feb. 28th, 2004.

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2005-02-22 17:09:50
62Cryptographic protocols / Electronic commerce / Computational hardness assumptions / RSA / Diffie–Hellman key exchange / Diffie–Hellman problem / Discrete logarithm / Schmidt–Samoa cryptosystem / Paillier cryptosystem / Cryptography / Public-key cryptography / Finite fields

CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2007-01-06 01:59:49
63Finite fields / Computational hardness assumptions / Diffie–Hellman key exchange / ElGamal encryption / XTR / RSA / Diffie–Hellman problem / Computational Diffie–Hellman assumption / Discrete logarithm / Cryptography / Public-key cryptography / Cryptographic protocols

CS255: Cryptography and Computer Security Winter 2003 Assignment #3 Due: Monday, March 3rd, 2003 at 5pm in CS255 box next to Gates 182.

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2003-02-18 23:13:10
64Finite fields / Cryptographic protocols / Electronic commerce / Diffie–Hellman key exchange / XTR / ElGamal encryption / RSA / Computational Diffie–Hellman assumption / Discrete logarithm / Cryptography / Public-key cryptography / Computational hardness assumptions

CS255: Cryptography and Computer Security Winter 2004 Assignment #3 Due: Monday, March 1st, 2004.

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2004-02-22 02:05:11
65Modular arithmetic / Public-key cryptography / Finite fields / Integer factorization algorithms / RSA / Euclidean algorithm / Prime number / Discrete logarithm / Chinese remainder theorem / Abstract algebra / Mathematics / Cryptography

Cryptography and Computer Security CS255 Basic number theory fact sheet Part II: Arithmetic modulo composites

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2008-01-05 22:45:30
66Cryptographic protocols / Electronic commerce / Computational hardness assumptions / RSA / Diffie–Hellman key exchange / Diffie–Hellman problem / Discrete logarithm / Schmidt–Samoa cryptosystem / Paillier cryptosystem / Cryptography / Public-key cryptography / Finite fields

CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2005-01-04 13:22:38
67Modular arithmetic / Public-key cryptography / Finite fields / Integer factorization algorithms / RSA / Euclidean algorithm / Prime number / Discrete logarithm / Chinese remainder theorem / Abstract algebra / Mathematics / Cryptography

Cryptography and Computer Security CS255 Basic number theory fact sheet Part II: Arithmetic modulo composites

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2009-01-03 00:02:54
68Modular arithmetic / Public-key cryptography / Finite fields / Integer factorization algorithms / RSA / Prime number / Euclidean algorithm / Discrete logarithm / Coprime / Abstract algebra / Mathematics / Cryptography

CS255: Cryptography and Computer Security Winter 2003 Basic number theory fact sheet Part II: Arithmetic modulo composites

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2003-02-10 15:18:01
69Polynomial

New algorithm for the discrete logarithm problem on elliptic curves Igor Semaev Department of Informatics University of Bergen, Norway e-mail: [removed]

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-10 15:18:51
    70Modular arithmetic / Public-key cryptography / Finite fields / Integer factorization algorithms / RSA / Euclidean algorithm / Prime number / Discrete logarithm / Chinese remainder theorem / Abstract algebra / Mathematics / Cryptography

    Cryptography and Computer Security CS255 Basic number theory fact sheet Part II: Arithmetic modulo composites

    Add to Reading List

    Source URL: crypto.stanford.edu

    Language: English - Date: 2015-01-03 18:17:27
    UPDATE